A first-order interior-point method for linearly constrained smooth optimization
نویسندگان
چکیده
We propose a first-order interior-point method for linearly constrained smooth optimization that unifies and extends first-order affine-scaling method and replicator dynamics method for standard quadratic programming. Global convergence and, in the case of quadratic program, (sub)linear convergence rate and iterate convergence results are derived. Numerical experience on simplex constrained problems with 1000 variables is reported.
منابع مشابه
An Interior-Point Algorithm for Linearly Constrained Optimization
We describe an algorithm for optimization of a smooth function subject to general linear constraints. An algorithm of the gradient projection class is used, with the important feature that the \projection" at each iteration is performed using a primal-dual interior point method for convex quadratic programming. Convergence properties can be maintained even if the projection is done inexactly in...
متن کاملLimited memory interior point bundle method for large inequality constrained nonsmooth minimization
Many practical optimization problems involve nonsmooth (that is, not necessarily differentiable) functions of hundreds or thousands of variables with various constraints. In this paper, we describe a new efficient adaptive limited memory interior point bundle method for large, possible nonconvex, nonsmooth inequality constrained optimization. The method is a hybrid of the nonsmooth variable met...
متن کاملA Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
A scheme|inspired from an old idea due to Mayne and Polak (Math. Prog., vol. 11, 1976, pp. 67{80)|is proposed for extending to general smooth constrained optimization problems a previously proposed feasible interior-point method for inequality constrained problems. It is shown that the primal-dual interior point framework allows for a signi cantly more e ective implementation of the Mayne-Polak...
متن کاملA globally convergent primal-dual interior-point three-dimensional filter method for nonlinear semidefinite programming
This paper proposes a primal-dual interior-point filter method for nonlinear semidefinite programming, which is the first multidimensional (three-dimensional) filter methods for interior-point methods, and of course for constrained optimization. A freshly new definition of filter entries is proposed, which is greatly different from those in all the current filter methods. A mixed norm is used t...
متن کاملLinearly Constrained Lq and Lqg Optimal Control
It has recently been shown that the logarithmic barrier method for solving nite-dimensional, linearly constrained quadratic optimization problems can be extended to an innnite-dimensional setting with complexity estimates similar to the nite dimensional case. As a consequence, an eecient computational method for solving the linearly constrained LQ control problem is now a vailable. In this pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 127 شماره
صفحات -
تاریخ انتشار 2011